Internal Strategies in a Re ective Logic ?
نویسنده
چکیده
After introducing the basic notions of reeective logic and internal strategies, we discuss in detail how reeection can be systematically exploited to design a strategy language internal to a reeective logic in the concrete case of rewriting logic and Maude; and we illustrate the advantages of this new approach to strategies by showing how the rules of inference for Knuth-Bendix completion can be given strategies corresponding to completion procedures in a completely modular way, not requiring any change whatsoever to the inference rules themselves.
منابع مشابه
Axiomatizing Re ective Logics and Languages
The very success and breadth of re ective techniques underscores the need for a general theory of re ection. At present what we have is a wide-ranging variety of re ective systems, each explained in its own idiosyncratic terms. Metalogical foundations can allow us to capture the essential aspects of re ective systems in a formalismindependent way. This paper proposes metalogical axioms for re e...
متن کاملTowards a Theory of Re ective Programming Languages (
This paper attempts to develop a better theoretical understanding of re ective systems. We begin by a developing a re ective extension of the v -calculus and de ne a simple operational semantics for it based on the in nite tower model described in [10]. We then develop an equational logic from this semantics. The resulting logic is shown to be weak because of re ective properties. We establish ...
متن کاملTowards a theory of reflective programming languages
This paper attempts to develop a better theoretical understanding of re ective systems. We begin by a developing a re ective extension of the v-calculus and de ne a simple operational semantics for it based on the in nite tower model described in [10]. We then develop an equational logic from this semantics. The resulting logic is shown to be weak because of re ective properties. We establish p...
متن کاملAn Example for Concurrent Re ective Computations in Rewriting Logic
Rewriting logic can represent dynamic behaviors of concurrent and/or reactive systems declaratively. Declarative descriptions in rewriting logic are expected to be amenable to analysis of interesting properties. The group-wide architecture based on the actor model is a speci c concurrent re ective computation model based on "group-wide re ection". It has a potential of modeling cooperative beha...
متن کاملHigher Order Functional Logic Programming A Systematic Development
We develop an e ective model for higher order functional logic programming by re ning higher order narrowing calculi The re nements reduce the high degree of non determinism in narrowing calculi utilizing properties of functional logic programs These include convergent and left linear rewrite rules All re nements can be combined to a narrowing strategy which generalizes call by need as in funct...
متن کامل